An Alternative Heuristics for Bin Packing Problem

نویسندگان

  • Nurul Afza Hashim
  • Faridah Zulkipli
  • Siti Sarah Januri
  • Radiah Shariff
چکیده

This study describes an alternative development of metaheuristic approaches to automate a one dimensional problem. Extensive computational testing is done to demonstrate the effectiveness of the proposed heuristic, a Variable Neighbourhood Search (VNS)-based algorithm. Several heuristics algorithms that have been used for solving the bin packing problem, Exact algorithm, Random Algorithm, First Fit Algorithm, Best Fit Algorithm, First Fit Decreasing Algorithm and Best Fit Decreasing Algorithm are incorporated into VNS and re-run for the results. The procedures have been coded in Matlab 2010 version 7.11 and the statistic was calculated with SPSS version 17.0. This study used two classes of bin packing problem instances (uniform and triplets) available in the OR Library. Results are compared to the reference solutions or the best known lower bounds where the optimum is not known. The results of the analysis showed that the combination with Best Fit Decreasing and First Fit Decreasing are remarkably effective tools for solving the bin packing problem. However, First Fit Decreasing found the existing best known or optimal solution to 8 instances with the least processing time. The success of VNS with the basic algorithms indicates that the results of this study can provide an alternative heuristic for one dimensional bin packing problem.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items

In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...

متن کامل

New Worst-case Results for the Bin-Packing Problem

In this note we consider the familiar bin-packing problem and provide new worst-case results for a number of classical heuristics. We show that the first-fit and best-fit heuristics have an absolute performance ratio of no more than 1.75, and first-fit decreasing and best-fit decreasing heuristics have an absolute performance ratio of 1.5. The latter is the best possible absolute performance ra...

متن کامل

An Empirical Study of Three Packing Heuristics for Bins with Adjustable Capacity – an Application to Operating Room Scheduling

Using simulation, we compare three offline packing heuristics for adjustable-size bins, a problem derived from operating room scheduling, on 500 days of generated data using different cost structures. Unlike classical bin-packing studies, we found that next-fit-decreasing is the best performing method. Subject Areas: Simulation, Bin Packing, OR and Scheduling.

متن کامل

Heuristics for Solving the Bin-Packing Problem with Conflicts

This paper deals to solve the one dimensional bin-packing problem with conflicts. The conflicts are represented by a graph whose nodes are the items, and adjacent items cannot be packed into the same bin. We propose an adaptation of Minimum Bin Slack heuristic also with a combination of heuristics based on the uses of the classical bin-packing methods to packing items of maximal-stable-subsets ...

متن کامل

A Graph Theoretic Approach for Minimizing Storage Space using Bin Packing Heuristics

In the age of Big Data the problem of storing huge volume of data in a minimum storage space by utilizing available resources properly is an open problem and an important research aspect in recent days. This problem has a close relationship with the famous classical NP-Hard combinatorial optimization problem namely the “Bin Packing Problem” where bins represent available storage space and the p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013